A Recursive Least-squares Extension of the Natural Gradient Algorithm for Blind Signal Separation of Audio Mixtures
نویسندگان
چکیده
Blind Signal Separation (BSS) refers to the operation of recovering a set of sources that are as independent as possible from another set of observed linear or non-linear mixtures. The term blind indicates that this operation is done without knowing the mixing coefficients. Although this problem is more difficult than the classical filtering problem, a solution is still feasible provided that some information about the original independent components is provided. Major attention in the literature has been focused on different criteria to be used as objective functions for BSS. However, most of the existing on-line methods can be categorized as using a stochastic gradient. The need for second-order based algorithms for BSS can be easily revealed, as the fast convergence rate of the Recursive-Least-Squares (RLS) based algorithms can be advantageous for many applications. Among the many existing objective functions for Blind Signal Separation, Maximum Likelihood and Negentropy stand as strong criteria which are well justified, as they minimize the mutual information between the original independent components [1],[2]. Maximum likelihood proved especially suitable for heavy tailed distribution signals, such as audio data [3].
منابع مشابه
Blind source separation using least-squares type adaptive algorithms
In this paper adaptive least-squares type algorithms are introduced for blind source separation. They are based on minimizing a criterion used in context with nonlinear PCA (Principal Component Analysis) networks. The new algorithms converge clearly faster and provide more accurate results than typical current adaptive blind separation algorithms based on instantaneous gradients. They are also ...
متن کاملBlind Signal Separation Using an Extended Infomax Algorithm
The Infomax algorithm is a popular method in blind source separation problem. In this article an extension of the Infomax algorithm is proposed that is able to separate mixed signals with any sub- or super-Gaussian distributions. This ability is the results of using two different nonlinear functions and new coefficients in the learning rule. In this paper we show how we can use the distribution...
متن کاملBlind Signal Separation Using an Extended Infomax Algorithm
The Infomax algorithm is a popular method in blind source separation problem. In this article an extension of the Infomax algorithm is proposed that is able to separate mixed signals with any sub- or super-Gaussian distributions. This ability is the results of using two different nonlinear functions and new coefficients in the learning rule. In this paper we show how we can use the distribution...
متن کاملImproving adaptive resolution of analog to digital converters using least squares mean method
This paper presents an adaptive digital resolution improvement method for extrapolating and recursive analog-to-digital converters (ADCs). The presented adaptively enhanced ADC (AE-ADC) digitally estimates the digital equivalent of the input signal by utilizing an adaptive digital filter (ADF). The least mean squares (LMS) algorithm also determines the coefficients of the ADF block. In this sch...
متن کاملRecursive complex BSS via generalized eigendecomposition and application in image rejection for BPSK
Under the assumptions of non-Gaussian, non-stationary, or non-white independent sources, linear blind source separation can be formulated as generalized eigenvalue decomposition. Here we provide an elegant method of doing this on-line, instead of waiting for a sufficiently large batch of data. This is done through a recursive generalized eigendecomposition algorithm that tracks the optimal solu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004